adjacency matrix
英
美
邻（连）接矩阵
双语例句
- We cannot boss them into doing more
我们不能再差遣他们做更多的事了。 - A Improved Simple Algorithm to Compute Reachability Matrix with Adjacency Matrix
由邻接矩阵求解可达矩阵的一种改进简便算法 - There are go-return route and out-in routes in bus route, use the method of better adjacency matrix to implement this kind of bus change.
针对公交线路中存在往返路线不一致、内外线路等情况，对用改进的邻接矩阵方法实现这一类型的公交换乘进行了研究。 - With the adjacency matrix of undirected networks, should show the selected villages to the shortest distance of the village.
用邻接矩阵表示无向网，应显示所选中的村庄到各村庄的最短距离。 - The directional graphic of fault propagation is established, and the adjacency matrix is obtained;
首先建立故障传播有向图，获取邻接矩阵； - Another matrix associated with G is the adjacency matrix.
伴随于G的另一个矩阵是邻接矩阵。 - Topology Structure of Object Network Reproduced by Adjacency Matrix
运用邻接矩阵法重现目标网络拓扑结构 - In this thesis, we investigate the application of graph spectra on the energy and the properties of the adjacency matrix of graphs.
本文我们研究谱图理论在图的能量及图的邻接矩阵的性质方面的应用。 - Adjacency matrix of the storage structure of the graph for the DFS and BFS traversals.
对以邻接矩阵为存储结构的图进行DFS和BFS遍历。 - An Algorithm for Seeking Monitor-Nodes Measuring Network Traffic Based on Adjacency Matrix
基于邻接矩阵的网络流量检测点设置算法 - Fault tolerance of multi-robot formation based on adjacency matrix
基于相邻矩阵的多机器人编队容错控制 - Graphical power network topology analysis based on adjacency matrix
基于邻接矩阵的图形化网络拓扑分析方法 - Intelligent navigation method for product design based on extended adjacency matrix of directed graph
基于有向图邻接矩阵扩展的产品设计智能导航 - The edges for this step can be found in the adjacency matrix.
此步骤的边可以在邻接矩阵中找到。 - Study on speedup computation techniques of adjacency matrix algorithm for station and substation reliability evaluation;
文中对邻接矩阵算法的加速计算技术进行了深入研究。 - Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph ( A).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通（A）。 - Distance In this paper, a novel topological index Zw based on the adjacency matrix D is derived.
以分子图的邻接矩阵，距离矩阵为基础，构建了新的拓扑指数Zw。 - On the basis of adjacency matrix of directed graph, the characteristics of this type of matrix is analyzed, and thereby the paper gives a new algorithm to convert the adjacency matrix to path matrix directly, and presents a study on this algorithm.
在已知有向图的邻接矩阵的基础上，分析邻接矩阵的特点，从而给出了一种直接由邻接矩阵求解路径矩阵的新算法，并对其算法进行了分析和研究。 - A methodology of product structure modeling on the basis of weighted digraph was proposed. The storage structure of this model was expressed by node vectors and adjacency matrix. The algorithm of transferring the graphic model into the storage structure was put forward.
提出了用赋权有向图建立产品结构模型的方法，用点向量和邻接矩阵表达了该模型的存储结构，讨论了将图形模型转换为存储结构的算法。 - This paper presents an adjacency matrix method for identifying topological symmetry to planar kinematic chains with multiple joints.
提出了识别含复铰平面运动链拓扑对称性的邻接矩阵方法。 - An ontology graph model, which creates ontology adjacency matrix and ontology reachability matrix, is described. Depending on matrix shift and calculation, ripple-effect of ontology evolution can be analyzed and its quantity can be ascertained.
本文提出了一种本体图模型，建立了本体邻接矩阵和可达矩阵，凭借矩阵变换与运算对本体演化中的波及效应进行了深入的分析和量化界定； - Three methods of computing accessibility matrix from adjacency matrix are introduced in this paper.
介绍了由邻接矩阵求可达性矩阵的三个方法。 - Based on the adjacency matrix of the network graph, the theoretical proof of the topological arithmetic is given.
以图论中邻接矩阵为基础，给出了该算法的理论证明。 - Some new concepts of efficient incidence matrix, ascending order adjacency matrix and vertex end-result are introduced, and some improvements of the maximum weight matching algorithm are made.
本文提出了有效关联矩阵、升阶邻接矩阵、点的归宿等一些新概念，对最大权匹配算法作了一些改进。 - In this paper structure of the mechanism and relationship among parts are recognized by analyzing the adjacency matrix.
通过对符号方案的邻接矩阵元素进行分析，得到机构的结构组成、构件连接关系等信息； - By using directed graph to represent text string, the adjacency matrix of text string is introduced.
通过使用有向图表示文本串，引出关于文本串的邻接矩阵； - This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。 - The spectral radius of a graph is the largest eigenvalue of its adjacency matrix.
3谱半径是指图的邻接矩阵的特征多项式的最大特征根。 - Spectral graph theory is mainly about the study on the algebraic properties of adjacency matrix and Laplacian matrix.
谱图理论主要是对邻接矩阵和Laplacian矩阵矩阵的代数性质和组合性质进行研究。 - This method effectively reduces the computing scale of adjacency matrix, consequently reduces the time of calculating adjacency matrix.
这种方法能有效减少邻接矩阵的规模，从而提高邻接矩阵的计算效率。